0.11/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.14 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.34 % Computer : n028.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 15:36:17 EDT 2021 0.13/0.35 % CPUTime : 0.13/0.35 % Number of cores: 8 0.13/0.35 % Python version: Python 3.6.8 0.13/0.35 # Version: 2.6rc1-ho 0.13/0.36 # No SInE strategy applied 0.13/0.36 # Trying AutoSched0 for 59 seconds 0.13/0.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN 0.13/0.40 # and selection function PSelectComplexExceptUniqMaxHorn. 0.13/0.40 # 0.13/0.40 # Preprocessing time : 0.034 s 0.13/0.40 # Presaturation interreduction done 0.13/0.40 0.13/0.40 # Proof found! 0.13/0.40 # SZS status Theorem 0.13/0.40 # SZS output start CNFRefutation 0.13/0.40 thf(hoasinduction_lem3v2a, axiom, (hoasinduction_lem3v2a<=>![X19:subst > term > subst > $o, X9:term > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X19 @ id @ X1 @ id=>X19 @ id @ (X12 @ id @ X1) @ id)=>X19 @ id @ (hoaslam @ id @ (^[X3:subst, X1:term]:X12 @ X3 @ X1)) @ id))=>(hoasinduction_p_and_p_prime @ X19 @ X9=>![X1:term]:(![X2:term]:(X9 @ X2=>X9 @ (sub @ X1 @ (push @ X2 @ id)))=>X9 @ (lam @ X1))))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', hoasinduction_lem3v2a)). 0.13/0.40 thf(hoasinduction_p_and_p_prime, axiom, (hoasinduction_p_and_p_prime)=(^[X14:subst > term > subst > $o, X9:term > $o]:![X10:term]:(X9 @ X10<=>X14 @ id @ X10 @ id)), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', hoasinduction_p_and_p_prime)). 0.13/0.40 thf(hoasinduction_lem3v2a_lthm, axiom, (hoasinduction_lem3v2a_lthm<=>(hoasinduction_lem3v2_f=>(axvarid=>(axvarshift=>(axclos=>(axmap=>hoasinduction_lem3v2a)))))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', hoasinduction_lem3v2a_lthm)). 0.13/0.40 thf(axvarid, axiom, (axvarid<=>![X1:term]:(sub @ X1 @ id)=(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', axvarid)). 0.13/0.40 thf(axclos, axiom, (axclos<=>![X1:term, X3:subst, X4:subst]:(sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', axclos)). 0.13/0.40 thf(axmap, axiom, (axmap<=>![X1:term, X3:subst, X4:subst]:(comp @ (push @ X1 @ X3) @ X4)=(push @ (sub @ X1 @ X4) @ (comp @ X3 @ X4))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', axmap)). 0.13/0.40 thf(axvarshift, axiom, (axvarshift<=>(push @ one @ sh)=(id)), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', axvarshift)). 0.13/0.40 thf(hoasinduction_lem3v2_f, axiom, (hoasinduction_lem3v2_f<=>![X2:term]:?[X12:subst > term > term]:![X1:term, X3:subst]:(X12 @ X3 @ X1)=(sub @ X2 @ (push @ X1 @ X3))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', hoasinduction_lem3v2_f)). 0.13/0.40 thf(thm, conjecture, hoasinduction_lem3v2a_lthm, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thm)). 0.13/0.40 thf(hoaslam, axiom, (hoaslam)=(^[X3:subst, X12:subst > term > term]:lam @ (X12 @ sh @ one)), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', hoaslam)). 0.13/0.40 thf(c_0_10, axiom, (hoasinduction_lem3v2a)=(![X19:subst > term > subst > $o, X9:term > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X19 @ id @ X1 @ id=>X19 @ id @ (X12 @ id @ X1) @ id)=>X19 @ id @ (hoaslam @ id @ (^[X3:subst, X1:term]:X12 @ X3 @ X1)) @ id))=>(![X325:term]:(X9 @ X325<=>X19 @ id @ X325 @ id)=>![X1:term]:(![X2:term]:(X9 @ X2=>X9 @ (sub @ X1 @ (push @ X2 @ id)))=>X9 @ (lam @ X1))))), inference(apply_def,[status(thm)],[hoasinduction_lem3v2a, hoasinduction_p_and_p_prime])). 0.13/0.40 thf(c_0_11, axiom, (hoasinduction_lem3v2a_lthm)=((![X2:term]:?[X12:subst > term > term]:![X1:term, X3:subst]:(X12 @ X3 @ X1)=(sub @ X2 @ (push @ X1 @ X3))=>(![X1:term]:(sub @ X1 @ id)=(X1)=>((push @ one @ sh)=(id)=>(![X1:term, X3:subst, X4:subst]:(sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4))=>(![X1:term, X3:subst, X4:subst]:(comp @ (push @ X1 @ X3) @ X4)=(push @ (sub @ X1 @ X4) @ (comp @ X3 @ X4))=>![X19:subst > term > subst > $o, X9:term > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X19 @ id @ X1 @ id=>X19 @ id @ (X12 @ id @ X1) @ id)=>X19 @ id @ (hoaslam @ id @ (^[X3:subst, X1:term]:X12 @ X3 @ X1)) @ id))=>(![X325:term]:(X9 @ X325<=>X19 @ id @ X325 @ id)=>![X1:term]:(![X2:term]:(X9 @ X2=>X9 @ (sub @ X1 @ (push @ X2 @ id)))=>X9 @ (lam @ X1)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[hoasinduction_lem3v2a_lthm, axvarid]), axclos]), axmap]), axvarshift]), hoasinduction_lem3v2_f]), c_0_10])). 0.13/0.40 thf(c_0_12, plain, ![X1:term, X3:subst, X12:subst > term > term]:(esk1_3 @ X12 @ X3 @ X1)=(X12 @ X3 @ X1), introduced(definition)). 0.13/0.40 thf(c_0_13, negated_conjecture, ~((![X2:term]:?[X12:subst > term > term]:![X1:term, X3:subst]:(X12 @ X3 @ X1)=(sub @ X2 @ (push @ X1 @ X3))=>(![X1:term]:(sub @ X1 @ id)=(X1)=>((push @ one @ sh)=(id)=>(![X1:term, X3:subst, X4:subst]:(sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4))=>(![X1:term, X3:subst, X4:subst]:(comp @ (push @ X1 @ X3) @ X4)=(push @ (sub @ X1 @ X4) @ (comp @ X3 @ X4))=>![X19:subst > term > subst > $o, X9:term > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X19 @ id @ X1 @ id=>X19 @ id @ (X12 @ id @ X1) @ id)=>X19 @ id @ (hoaslam @ id @ (esk1_3 @ X12)) @ id))=>(![X325:term]:(X9 @ X325<=>X19 @ id @ X325 @ id)=>![X1:term]:(![X2:term]:(X9 @ X2=>X9 @ (sub @ X1 @ (push @ X2 @ id)))=>X9 @ (lam @ X1)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_11]), c_0_12])). 0.13/0.40 thf(c_0_14, plain, ![X356:term, X357:subst, X358:subst > term > term]:(esk1_3 @ X358 @ X357 @ X356)=(X358 @ X357 @ X356), inference(variable_rename,[status(thm)],[c_0_12])). 0.13/0.40 thf(c_0_15, plain, ![X3:subst, X12:subst > term > term]:(hoaslam @ X3 @ X12)=(lam @ (X12 @ sh @ one)), inference(fof_simplification,[status(thm)],[hoaslam])). 0.13/0.40 thf(c_0_16, negated_conjecture, ![X335:term, X337:term, X338:subst, X339:term, X340:term, X341:subst, X342:subst, X343:term, X344:subst, X345:subst, X348:subst > term > term, X353:term, X355:term]:((esk2_1 @ X335 @ X338 @ X337)=(sub @ X335 @ (push @ X337 @ X338))&((sub @ X339 @ id)=(X339)&((push @ one @ sh)=(id)&((sub @ (sub @ X340 @ X341) @ X342)=(sub @ X340 @ (comp @ X341 @ X342))&((comp @ (push @ X343 @ X344) @ X345)=(push @ (sub @ X343 @ X345) @ (comp @ X344 @ X345))&(((epred1_0 @ id @ (esk6_1 @ X348) @ id|epred1_0 @ id @ (hoaslam @ id @ (esk1_3 @ X348)) @ id|(sub @ (X348 @ (esk3_1 @ X348) @ (esk4_1 @ X348)) @ (esk5_1 @ X348))!=(X348 @ (comp @ (esk3_1 @ X348) @ (esk5_1 @ X348)) @ (sub @ (esk4_1 @ X348) @ (esk5_1 @ X348))))&(~epred1_0 @ id @ (X348 @ id @ (esk6_1 @ X348)) @ id|epred1_0 @ id @ (hoaslam @ id @ (esk1_3 @ X348)) @ id|(sub @ (X348 @ (esk3_1 @ X348) @ (esk4_1 @ X348)) @ (esk5_1 @ X348))!=(X348 @ (comp @ (esk3_1 @ X348) @ (esk5_1 @ X348)) @ (sub @ (esk4_1 @ X348) @ (esk5_1 @ X348)))))&(((~epred2_0 @ X353|epred1_0 @ id @ X353 @ id)&(~epred1_0 @ id @ X353 @ id|epred2_0 @ X353))&((~epred2_0 @ X355|epred2_0 @ (sub @ esk7_0 @ (push @ X355 @ id)))&~epred2_0 @ (lam @ esk7_0))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])). 0.13/0.40 thf(c_0_17, plain, ![X12:subst > term > term, X3:subst, X1:term]:(esk1_3 @ X12 @ X3 @ X1)=(X12 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_14])). 0.13/0.40 thf(c_0_18, plain, ![X333:subst, X334:subst > term > term]:(hoaslam @ X333 @ X334)=(lam @ (X334 @ sh @ one)), inference(variable_rename,[status(thm)],[c_0_15])). 0.13/0.40 thf(c_0_19, negated_conjecture, ![X12:subst > term > term]:(epred1_0 @ id @ (hoaslam @ id @ (esk1_3 @ X12)) @ id|~epred1_0 @ id @ (X12 @ id @ (esk6_1 @ X12)) @ id|(sub @ (X12 @ (esk3_1 @ X12) @ (esk4_1 @ X12)) @ (esk5_1 @ X12))!=(X12 @ (comp @ (esk3_1 @ X12) @ (esk5_1 @ X12)) @ (sub @ (esk4_1 @ X12) @ (esk5_1 @ X12)))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_20, plain, ![X12:subst > term > term]:(esk1_3 @ X12)=(X12), inference(pos_ext,[status(thm)],[c_0_17])). 0.13/0.40 thf(c_0_21, plain, ![X3:subst, X12:subst > term > term]:(hoaslam @ X3 @ X12)=(lam @ (X12 @ sh @ one)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.13/0.40 thf(c_0_22, negated_conjecture, ![X1:term, X2:term, X3:subst]:(esk2_1 @ X1 @ X3 @ X2)=(sub @ X1 @ (push @ X2 @ X3)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_23, negated_conjecture, (push @ one @ sh)=(id), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_24, negated_conjecture, ![X1:term]:(sub @ X1 @ id)=(X1), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_25, negated_conjecture, ![X12:subst > term > term]:(epred1_0 @ id @ (esk6_1 @ X12) @ id|epred1_0 @ id @ (hoaslam @ id @ (esk1_3 @ X12)) @ id|(sub @ (X12 @ (esk3_1 @ X12) @ (esk4_1 @ X12)) @ (esk5_1 @ X12))!=(X12 @ (comp @ (esk3_1 @ X12) @ (esk5_1 @ X12)) @ (sub @ (esk4_1 @ X12) @ (esk5_1 @ X12)))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_26, negated_conjecture, ![X12:subst > term > term]:(epred1_0 @ id @ (hoaslam @ id @ X12) @ id|(X12 @ (comp @ (esk3_1 @ X12) @ (esk5_1 @ X12)) @ (sub @ (esk4_1 @ X12) @ (esk5_1 @ X12)))!=(sub @ (X12 @ (esk3_1 @ X12) @ (esk4_1 @ X12)) @ (esk5_1 @ X12))|~epred1_0 @ id @ (X12 @ id @ (esk6_1 @ X12)) @ id), inference(rw,[status(thm)],[c_0_19, c_0_20])). 0.13/0.40 thf(c_0_27, negated_conjecture, ![X3:subst, X1:term]:(hoaslam @ X3 @ (esk2_1 @ X1))=(lam @ X1), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_24])). 0.13/0.40 thf(c_0_28, negated_conjecture, ![X1:term, X3:subst, X4:subst]:(comp @ (push @ X1 @ X3) @ X4)=(push @ (sub @ X1 @ X4) @ (comp @ X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_29, negated_conjecture, ![X1:term, X3:subst, X4:subst]:(sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_30, negated_conjecture, ![X12:subst > term > term]:(epred1_0 @ id @ (hoaslam @ id @ X12) @ id|epred1_0 @ id @ (esk6_1 @ X12) @ id|(X12 @ (comp @ (esk3_1 @ X12) @ (esk5_1 @ X12)) @ (sub @ (esk4_1 @ X12) @ (esk5_1 @ X12)))!=(sub @ (X12 @ (esk3_1 @ X12) @ (esk4_1 @ X12)) @ (esk5_1 @ X12))), inference(rw,[status(thm)],[c_0_25, c_0_20])). 0.13/0.40 thf(c_0_31, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (lam @ X1) @ id|~epred1_0 @ id @ (sub @ X1 @ (push @ (esk6_1 @ (esk2_1 @ X1)) @ id)) @ id), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_22]), c_0_27]), c_0_28]), c_0_29]), c_0_22]), c_0_22])])). 0.13/0.40 thf(c_0_32, negated_conjecture, ![X1:term]:(epred1_0 @ id @ X1 @ id|~epred2_0 @ X1), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_33, negated_conjecture, ![X1:term]:(epred2_0 @ X1|~epred1_0 @ id @ X1 @ id), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_34, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (esk6_1 @ (esk2_1 @ X1)) @ id|epred1_0 @ id @ (lam @ X1) @ id), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_22]), c_0_27]), c_0_28]), c_0_29]), c_0_22])])). 0.13/0.40 thf(c_0_35, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (lam @ X1) @ id|~epred2_0 @ (sub @ X1 @ (push @ (esk6_1 @ (esk2_1 @ X1)) @ id))), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.13/0.40 thf(c_0_36, negated_conjecture, ![X1:term]:(epred2_0 @ (sub @ esk7_0 @ (push @ X1 @ id))|~epred2_0 @ X1), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_37, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (lam @ X1) @ id|epred2_0 @ (esk6_1 @ (esk2_1 @ X1))), inference(spm,[status(thm)],[c_0_33, c_0_34])). 0.13/0.40 thf(c_0_38, negated_conjecture, epred1_0 @ id @ (lam @ esk7_0) @ id, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])). 0.13/0.40 thf(c_0_39, negated_conjecture, ~epred2_0 @ (lam @ esk7_0), inference(split_conjunct,[status(thm)],[c_0_16])). 0.13/0.40 thf(c_0_40, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_38]), c_0_39]), ['proof']). 0.13/0.40 # SZS output end CNFRefutation 0.13/0.40 # Proof object total steps : 41 0.13/0.40 # Proof object clause steps : 23 0.13/0.40 # Proof object formula steps : 18 0.13/0.40 # Proof object conjectures : 23 0.13/0.40 # Proof object clause conjectures : 20 0.13/0.40 # Proof object formula conjectures : 3 0.13/0.40 # Proof object initial clauses used : 13 0.13/0.40 # Proof object initial formulas used : 10 0.13/0.40 # Proof object generating inferences : 7 0.13/0.40 # Proof object simplifying inferences : 17 0.13/0.40 # Training examples: 0 positive, 0 negative 0.13/0.40 # Parsed axioms : 238 0.13/0.40 # Removed by relevancy pruning/SinE : 0 0.13/0.40 # Initial clauses : 138 0.13/0.40 # Removed in clause preprocessing : 124 0.13/0.40 # Initial clauses in saturation : 14 0.13/0.40 # Processed clauses : 63 0.13/0.40 # ...of these trivial : 1 0.13/0.40 # ...subsumed : 13 0.13/0.40 # ...remaining for further processing : 49 0.13/0.40 # Other redundant clauses eliminated : 0 0.13/0.40 # Clauses deleted for lack of memory : 0 0.13/0.40 # Backward-subsumed : 0 0.13/0.40 # Backward-rewritten : 0 0.13/0.40 # Generated clauses : 69 0.13/0.40 # ...of the previous two non-trivial : 56 0.13/0.40 # Contextual simplify-reflections : 1 0.13/0.40 # Paramodulations : 57 0.13/0.40 # Factorizations : 0 0.13/0.40 # NegExts : 0 0.13/0.40 # Equation resolutions : 0 0.13/0.40 # Propositional unsat checks : 0 0.13/0.40 # Propositional check models : 0 0.13/0.40 # Propositional check unsatisfiable : 0 0.13/0.40 # Propositional clauses : 0 0.13/0.40 # Propositional clauses after purity: 0 0.13/0.40 # Propositional unsat core size : 0 0.13/0.40 # Propositional preprocessing time : 0.000 0.13/0.40 # Propositional encoding time : 0.000 0.13/0.40 # Propositional solver time : 0.000 0.13/0.40 # Success case prop preproc time : 0.000 0.13/0.40 # Success case prop encoding time : 0.000 0.13/0.40 # Success case prop solver time : 0.000 0.13/0.40 # Current number of processed clauses : 35 0.13/0.40 # Positive orientable unit clauses : 20 0.13/0.40 # Positive unorientable unit clauses: 5 0.13/0.40 # Negative unit clauses : 1 0.13/0.40 # Non-unit-clauses : 9 0.13/0.40 # Current number of unprocessed clauses: 21 0.13/0.40 # ...number of literals in the above : 33 0.13/0.40 # Current number of archived formulas : 0 0.13/0.40 # Current number of archived clauses : 14 0.13/0.40 # Clause-clause subsumption calls (NU) : 12 0.13/0.40 # Rec. Clause-clause subsumption calls : 12 0.13/0.40 # Non-unit clause-clause subsumptions : 2 0.13/0.40 # Unit Clause-clause subsumption calls : 60 0.13/0.40 # Rewrite failures with RHS unbound : 40 0.13/0.40 # BW rewrite match attempts : 32 0.13/0.40 # BW rewrite match successes : 7 0.13/0.40 # Condensation attempts : 0 0.13/0.40 # Condensation successes : 0 0.13/0.40 # Termbank termtop insertions : 16945 0.13/0.40 0.13/0.40 # ------------------------------------------------- 0.13/0.40 # User time : 0.040 s 0.13/0.40 # System time : 0.008 s 0.13/0.40 # Total time : 0.048 s 0.13/0.40 # Maximum resident set size: 2000 pages 0.13/0.40 EOF